A Sufficient Descent Property for a Different Parameter to Enhance Three-Term Method
نویسندگان
چکیده
In this paper, we derive a new parameter µk-1 for the three-term CG (N3T) algorithm solving unconstrained optimization problems. As demonstrated by its calculations and proof, worth is determined T , study mentions four different types of . The search directions are always sufficiently descent when using strong Wolfe line (SWC). Under reasonable assumptions, proposed achieves global convergence. numerical comparison demonstrates that our method works well
منابع مشابه
A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we propose a general form of three-term conjugate gradient methods which always generate a sufficient descent direction. We give a sufficient condition for the global convergence of the proposed general method. Moreover, we pres...
متن کاملAn eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method
Based on an eigenvalue analysis, a new proof for the sufficient descent property of the modified Polak-Ribière-Polyak conjugate gradient method proposed by Yu et al. is presented.
متن کاملA new spectral PRP conjugate gradient method with sufficient descent property
In this paper, a new spectral PRP conjugate gradient method is proposed, which can always generate sufficient descent direction without any line search. Under some standard conditions, global convergence of the proposed method is established when the standard Armijo or weak Wolfe line search is used. Moreover, we extend these results to the HS method. Numerical comparisons are reported with som...
متن کاملA New Sufficient Descent Conjugate Gradient Method for Unconstrained Optimization
In this paper, a new conjugate conjugate method with sufficient descent property is proposed for the unconstrained optimization problem. An attractive property of the new method is that the descent direction generated by the method always possess the sufficient descent property, and this property is independent of the line search used and the choice of ki . Under mild conditions, the global c...
متن کاملA descent method for explicit computations on curves
It is shown that the knowledge of a surjective morphism $Xto Y$ of complex curves can be effectively used to make explicit calculations. The method is demonstrated by the calculation of $j(ntau)$ (for some small $n$) in terms of $j(tau)$ for the elliptic curve with period lattice $(1,tau)$, the period matrix for the Jacobian of a family of genus-$2$ curves complementing the classi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ma?alla? al-r?fidayn li-?ul?m al-??sib?t wa-al-riy??iyy??
سال: 2023
ISSN: ['1815-4816', '2311-7990']
DOI: https://doi.org/10.33899/csmj.2023.179508